Disjunctive !-Words and Real Numbers

نویسنده

  • Peter Hertling
چکیده

An !-word p over a nite alphabet is called disjunctive if every nite word over occurs as a subword in p. A real number is called disjunctive to base a if it has a disjunctive a-adic expansion. For every pair of integers a; b 2 such that there exist numbers disjunctive to base a but not to base b we explicitly construct very simple examples of such numbers. General versions of the following results are proved. If (ni)i2! is a strictly increasing sequence of positive integers with ni+1 3i for in nitely many i then P 3 ni is disjunctive to base 2. The number P 2 i! i is disjunctive to base a if a is even and not a power of 2. The sum P 2 c i is disjunctive to base 6 if c 3 is odd.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Large is the Set of Disjunctive Sequences?

We consider disjunctive sequences, that is, infinite sequences (ω-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described in an easy way using recursive languages and, besides being a set of measure one, is a residual set in Cantor space. Moreover, we consider the subword complexity of sequences: here disjunctive sequences are shown to b...

متن کامل

Nonlinear disjunctive kriging for the estimating and modeling of a vein copper deposit

ABSTRACT Estimation of mineral resources and reserves with low values of error is essential in mineral exploration. The aim of this study is to estimate and model a vein type deposit using disjunctive kriging method. Disjunctive Kriging (DK) as an appropriate nonlinear estimation method has been used for estimation of Cu values. For estimation of Cu values and modelling of the distributio...

متن کامل

Level mapping characterizations for quantitative and disjunctive logic programs

Several different approaches of logic programming semantics have been proposed during the last two decades. These semantics varied in many aspects and it was difficult to find the exact relationships between them. Hitzler and Wendt proposed a new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. They gave new characteri...

متن کامل

Monotone, Horn and Quadratic Pseudo-Boolean Functions

A pseudo-Boolean function (pBf) is a mapping from f0; 1gn to the real numbers. It is known that pseudo-Boolean functions have polynomial representations, and it was recently shown that they also have disjunctive normal forms (DNFs). In this paper we relate the DNF syntax of the classes of monotone, quadratic and Horn pBfs to their characteristic inequalities.

متن کامل

Topologies for the Set of

An infinite sequence (!-word) is referred to as disjunctive provided it contains every finite word as infix (factor). As Jürgensen and Thierrin [JT83] observed the set of disjunctive !-words, D, has a trivial syntactic monoid but is not accepted by a finite automaton. In this paper we derive some topological properties of the set of disjunctive!-words. We introduce two non-standard topologies o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996